Usability of Destination-Sequenced Distance Vector Routing Protocol Routes

The success of fundamental network tasks of traffic delivery from a source to a destination node is mainly dependent on the efficiency of the routing protocol. In mobile ad hoc networks, the effectiveness of routing protocols is additionally demanding due to the dynamic nature of network nodes. In this paper, we dealt with the exploitation of the routes generated using DSDV bellman-ford routing protocol. Through a total of 3960 network simulations with different topologies, network loads and mobility nodes, various parameters of the DSDV were considered. Our results show that there are a large number of unused routes, and techniques for improving the efficiency of routing and reducing routing overhead can be implemented

A deep stochastical and predictive analysis of users mobility based on Auto-Regressive processes and pairing functions

With the proliferation of connected vehicles, new coverage technologies and colossal bandwidth availability, the quality of service and experience in mobile computing play an important role for user satisfaction (in terms of comfort, security and overall performance). Unfortunately, in mobile environments, signal degradations very often affect the perceived service quality, and predictive approaches become necessary or helpful, to handle, for example, future node locations, future network topology or future system performance. In this paper, our attention is focused on an in-depth stochastic micro-mobility analysis in terms of nodes coordinates. Many existing works focused on different approaches for realizing accurate mobility predictions. Still, none of them analyzed the way mobility should be collected and/or observed, how the granularity of mobility samples collection should be set and/or how to interpret the collected samples to derive some stochastic properties based on the mobility type (pedestrian, vehicular, etc.). The main work has been carried out by observing the characteristics of vehicular mobility, from real traces. At the same time, other environments have also been considered to compare the changes in the collected statistics. Several analyses and simulation campaigns have been carried out and proposed, verifying the effectiveness of the introduced concepts

On packet marking and Markov modeling for IP Traceback: A deep probabilistic and stochastic analysis

From many years, the methods to defend against Denial of Service attacks have been very attractive from different point of views, although network security is a large and very complex topic. Different techniques have been proposed and so-called packet marking and IP tracing procedures have especially demonstrated a good capacity to face different malicious attacks. While host-based DoS attacks are more easily traced and managed, network-based DoS attacks are a more challenging threat. In this paper, we discuss a powerful aspect of the IP traceback method, which allows a router to mark and add information to attack packets on the basis of a fixed probability value. We propose a potential method for modeling the classic probabilistic packet marking algorithm as Markov chains, allowing a closed form to be obtained for evaluating the correct number of received marked packets in order to build a meaningful attack graph and analyze how marking routers must behave to minimize the overall overhead

Secrecy outage probability of a NOMA scheme and impact imperfect channel state information in underlay cooperative cognitive networks

Security performance and the impact of imperfect channel state information (CSI) in underlay cooperative cognitive networks (UCCN) is investigated in this paper. In the proposed scheme, relay R uses non-orthogonal multiple access (NOMA) technology to transfer messages e1, e2 from the source node S to User 1 (U1) and User 2 (U2), respectively. An eavesdropper (E) is also proposed to wiretap the messages of U1 and U2. The transmission’s security performance in the proposed system was analyzed and performed over Rayleigh fading channels. Through numerical analysis, the results showed that the proposed system’s secrecy performance became more efficient when the eavesdropper node E was farther away from the source node S and the intermediate cooperative relay R. The secrecy performance of U1 was also compared to the secrecy performance of U2. Finally, the simulation results matched the Monte Carlo simulations well

A decentralized ITS architecture for efficient distribution of traffic task management

In this paper, the attention is focused on the design of a new multi-layered architecture for vehicular environment. System will be able to gather information from vehicular devices. This will allow system to faster respond at emergency situation such as traffic jams or collisions. Distributed entities work at different layers exploiting cloud and fog computing in order to better distribute tasks along the infrastructure. Lower layer is composed of On-Board Units (OBUs) and RoadSide Units (RSUs) that exploits Vehicular Ad-hoc Network (VANET) protocols for inner VANET communications. At the Edge layer we propose fog computing nodes that gather data from RSUs for local processing and after an aggregation step they send data to an Intelligent Transportation System (ITS) management system. The proposed architecture has the main goal to better respond to the network and traffic dynamics by improving performances of the ITS system

A Novel approach to quality-of-service provisioning in trusted relay quantum key distribution networks

In recent years, noticeable progress has been made in the development of quantum equipment, reflected through the number of successful demonstrations of Quantum Key Distribution (QKD) technology. Although they showcase the great achievements of QKD, many practical difficulties still need to be resolved. Inspired by the significant similarity between mobile ad-hoc networks and QKD technology, we propose a novel quality of service (QoS) model including new metrics for determining the states of public and quantum channels as well as a comprehensive metric of the QKD link. We also propose a novel routing protocol to achieve high-level scalability and minimize consumption of cryptographic keys. Given the limited mobility of nodes in QKD networks, our routing protocol uses the geographical distance and calculated link states to determine the optimal route. It also benefits from a caching mechanism and detection of returning loops to provide effective forwarding while minimizing key consumption and achieving the desired utilization of network links. Simulation results are presented to demonstrate the validity and accuracy of the proposed solutions

Impact of security on speech quality

This paper deals with impact of secured environment on speech quality of IP telephony. There are presented the results of the analyzing of voice over secure communication links based on TLS. The using of secure network environments can affect a speech quality. There is the performance comparision of cipher alghorithms and description how the used security mechanisms influence the final R- factor. The presented results are based on numerous of experiments which have been performed in real IP networ

An Optimal Analysis in Wireless Powered Full-duplex Relaying Network

Wireless-powered cellular networks (WPCNs) are currently being investigated to exploit the reliability and improve battery lifetime of mobile users. This paper investigates the energy harvesting structure of the full-duplex relaying networks. By using the time switching based relaying (TSR) protocol and Amplify-and-Forward (AF) model in delay-limited transmission scheme, we propose the closed-form expression of the outage probability and then calculate the optimal throughput. An important result can be taken obviously that the time fraction in TSR, the position of relay, the noise as well as the energy conversation impacting on the outage probability as well as the optimal throughput. By Monte Carlo simulation, the numerical results indicate an effective relaying strategy in full-duplex cooperative systems. Finally, we provide fundamental design guidelines for selecting time fraction in TSR that satisfies the requirements of a practical relaying system

Wireless Powered Relaying Networks Under Imperfect Channel State Information: System Performance and Optimal Policy for Instantaneous Rate

In this investigation, we consider wireless powered relaying systems, where energy is scavenged by a relay via radio frequency (RF) signals. We explore hybrid time switching-based and power splitting-based relaying protocol (HTPSR) and compare performance of Amplify-and-Forward (AF) with Decode-and-Forward (DF) scheme under imperfect channel state information (CSI). Most importantly, the instantaneous rate, achievable bit error rate (BER) are determined in the closed-form expressions under the impact of imperfect CSI. Through numerical analysis, we evaluate system insights via different parameters such as power splitting (PS) and time switching (TS) ratio of the considered HTPSR which affect outage performance and BER. It is noted that DF relaying networks outperform AF relaying networks. Besides that, the numerical results are given to prove the optimization problems of PS and TS ratio to obtain optimal instantaneous rate

Analysis of Probability of Non-zero Secrecy Capacity for Multi-hop Networks in Presence of Hardware Impairments over Nakagami-m Fading Channels

In this paper, we evaluate probability of non-zero secrecy capacity of multi-hop relay networks over Nakagami-m fading channels in presence of hardware impairments. In the considered protocol, a source attempts to transmit its data to a destination by using multi-hop randomize-and-forward (RF) strategy. The data transmitted by the source and relays are overheard by an eavesdropper. For performance evaluation, we derive exact expressions of probability of non-zero secrecy capacity (PoNSC), which are expressed by sums of infinite series of exponential functions and exponential integral functions. We then perform Monte Carlo simulations to verify the theoretical analysis